Optimizing over the efficient set of the binary bi-objective knapsack problem

This paper deals with the problem of optimizing a linear function over efficient set 0-1 bi-objective knapsack problem. Such represents main criterion posed. The resolution process is based essentially on dynamic programming. proposed method provides subset solutions including one which optimizes without having to enumerate all Numerical experiments are reported, different instances large sizes associated sets considered show efficiency our algorithm compared an approach in literature.